Pipelined Hash Joins Using Network of Workstations
نویسندگان
چکیده
Drrnands for h ish transaction procrssing rates from databasc systsms Ird to the use of parallel processing techniqiiçs for transxtions and queries. Most commercial parallel database systems suffer from sxceptionally high hardware and software costs. Availùbility of public domain software (such as PVM and MPI) that hnmcsses several workstations on a LXN into a vinual pardlel machine provides a welcome alternative for parallel query processing. This thesis exploits such a Network of Workstations for intra-qurry (pipe l i n d ) and intrn-operation (partitionrd) parallelism usin_o the Hash Join algorithm in a crntralizrd qurry processing architectiire. A comprehensive performance evaluation siigsests that Pipelined Hash Joins rxhibit significant improvemrnt in response timr for complex queries and for qurries consiiming very large input relations.
منابع مشابه
Applying Segmented Right-Deep Trees to Pipelining Multiple Hash Joins
The pipelined execution of multijoin queries in a multiprocessor-based database system is explored in this paper. Using hash-based joins, multiple joins can be pipelined so that the early results from a join, before the whole join is completed, are sent to the next join for processing. The execut ion of a query is usually denoted by a query execution tree. To improve the execution of pipelined ...
متن کاملUsing Segmented Right-Deep Trees for the Execution of Pipelined Hash Joins
In this paper, we explore the execution of pipelined hash joins in a multiprocessor-based database system. To improve the query execution, an innovative approach on query execution tree selection is proposed to exploit segmented right-deep trees, which are bushy trees of right-deep subtrees. We first derive an analytical model for the execution of a pipeline segment, and then, in light of the m...
متن کاملSTAN - CS - 9 l - 135 1 Sequence vs . Pipeline Parallel Multiple Joins in Paradata
In this report we analyze and compare hash-join based parallel multi-join algorithms for sequenced and pipelined processing. The BBN Butterfly machine serves as the host for the performance analysis. The sequenced algorithm handles the multiple join operations in a conventional sequenced manner, except that it distributes the work load of each operation among all processors. The pipelined algor...
متن کاملCost-Controlled OFL Rewriting Rules for Multiple Collection Traversals
The integration of path expression evaluations in an object-oriented cost-driven query optimizer is the subject of this paper. We present rewriting rules that transform path expressions into different object target programs (i.e., query execution plans). An analytical cost model is presented and used to compare the quality of various programs. We have used the OFL (Object Functional Language) t...
متن کاملMemory-Efficient Hash Joins
We present new hash tables for joins, and a hash join based on them, that consumes far less memory and is usually faster than recently published in-memory joins. Our hash join is not restricted to outer tables that fit wholly in memory. Key to this hash join is a new concise hash table (CHT), a linear probing hash table that has 100% fill factor, and uses a sparse bitmap with embedded populatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001